Variable-Length Coding with Feedback: Finite-Length Codewords and Periodic Decoding

Theoretical analysis has long indicated that feedback improves the error exponent but not the capacity of single-user memoryless channels. Recently Polyanskiy et al. studied the benefit of variable-length feedback with termination (VLFT) codes in the non-asymptotic regime. In that work, achievability is based on an infinite length random code and decoding is attempted at every symbol. The coding rate backoff from capacity due to channel dispersion is greatly reduced with feedback, allowing capacity to be approached with surprisingly small expected latency. This paper is mainly concerned with VLFT codes based on finite-length codes and decoding attempts only at certain specified decoding times. The penalties of using a finite block-length $N$ and a sequence of specified decoding times are studied. This paper shows that properly scaling $N$ with the expected latency can achieve the same performance up to constant terms as with $N = \infty$. The penalty introduced by periodic decoding times is a linear term of the interval between decoding times and hence the performance approaches capacity as the expected latency grows if the interval between decoding times grows sub-linearly with the expected latency.Comment: 8 pages. A shorten version is submitted to ISIT 201

A Rate-Compatible Sphere-Packing Analysis of Feedback Coding with Limited Retransmissions

Recent work by Polyanskiy et al. and Chen et al. has excited new interest in using feedback to approach capacity with low latency. Polyanskiy showed that feedback identifying the first symbol at which decoding is successful allows capacity to be approached with surprisingly low latency. This paper uses Chen's rate-compatible sphere-packing (RCSP) analysis to study what happens when symbols must be transmitted in packets, as with a traditional hybrid ARQ system, and limited to relatively few (six or fewer) incremental transmissions. Numerical optimizations find the series of progressively growing cumulative block lengths that enable RCSP to approach capacity with the minimum possible latency. RCSP analysis shows that five incremental transmissions are sufficient to achieve 92% of capacity with an average block length of fewer than 101 symbols on the AWGN channel with SNR of 2.0 dB. The RCSP analysis provides a decoding error trajectory that specifies the decoding error rate for each cumulative block length. Though RCSP is an idealization, an example tail-biting convolutional code matches the RCSP decoding error trajectory and achieves 91% of capacity with an average block length of 102 symbols on the AWGN channel with SNR of 2.0 dB. We also show how RCSP analysis can be used in cases where packets have deadlines associated with them (leading to an outage probability).Comment: To be published at the 2012 IEEE International Symposium on Information Theory, Cambridge, MA, USA. Updated to incorporate reviewers' comments and add new figure

Increasing Flash Memory Lifetime by Dynamic Voltage Allocation for Constant Mutual Information

The read channel in Flash memory systems degrades over time because the Fowler-Nordheim tunneling used to apply charge to the floating gate eventually compromises the integrity of the cell because of tunnel oxide degradation. While degradation is commonly measured in the number of program/erase cycles experienced by a cell, the degradation is proportional to the number of electrons forced into the floating gate and later released by the erasing process. By managing the amount of charge written to the floating gate to maintain a constant read-channel mutual information, Flash lifetime can be extended. This paper proposes an overall system approach based on information theory to extend the lifetime of a flash memory device. Using the instantaneous storage capacity of a noisy flash memory channel, our approach allocates the read voltage of flash cell dynamically as it wears out gradually over time. A practical estimation of the instantaneous capacity is also proposed based on soft information via multiple reads of the memory cells.Comment: 5 pages. 5 figure

Ultrasonication-Assisted Spray Ionization Mass Spectrometry for the Analysis of Biomolecules in Solution

In this paper, we describe a novel technique—ultrasonication-assisted spray ionization (UASI)—for the generation of singly charged and multiply charged gas-phase ions of biomolecules (e.g., amino acids, peptides, and proteins) from solution; this method employs a low-frequency ultrasonicator (ca. 40 kHz) in place of the high electric field required for electrospray ionization. When a capillary inlet is immersed into a sample solution within a vial subjected to ultrasonication, the solution is continually directed to the capillary outlet as a result of ultrasonication-assisted capillary action; an ultrasonic spray of the sample solution is emitted at the outlet of the tapered capillary, leading to the ready generation of gas-phase ions. Using an ion trap mass spectrometer, we found that singly charged amino acid and multiply charged peptides/proteins ions were generated through this single-step operation, which is both straightforward and extremely simple to perform. The setup is uncomplicated: only a low-frequency ultrasonicator and a tapered capillary are required to perform UASI. The mass spectra of the multiply charged peptides and proteins obtained from sample solutions subjected to UASI resemble those observed in ESI mass spectra

A Novel Model Considered Mass and Energy Conservation for Both Liquid and Vapor in Adsorption Refrigeration System.

In this paper, we proposed a dynamic model for a two-bed adsorption refrigeration system. Different from most existing researches which assume saturation vaper pressure in each device, the proposed method models the pressure in each device by considering both the liquid and vaper content in the device. Therefore, it can be more accurate in describing the system response and more suitable for studying the system instrumentation. The components included in this system model are: adsorption bed, evaporator, condenser, expansion valve, and etc. Each device is modeled based on the energy and mass conservation. Furthermore, the adsorption phenomenon is modeled by the “Freundlich equation,†and “linear driving force model.†The phase change of the refrigerant in evaporator and condenser is modeled by Hertz-Knudsen theory. In a case study, the pressure of the adsorption bed during the adsorption process is estimated to be 0.7kPa by the proposed model, while it was 1.6kPa by conventional method which assuming saturated vapor pressure. The coefficient-of-performance of the adsorption system is estimated to be 0.246 by this model, 0.36 by conventional method, and 0.28 by experimental data. The proposed model can estimate system performance more accurate than the conventional method. Moreover, the proposed model also inspire a new instrumentation strategy for the adsorption system, in which the system efficiency is improved and the pressure surge is avoided

Feedback Communication Systems with Limitations on Incremental Redundancy

This paper explores feedback systems using incremental redundancy (IR) with noiseless transmitter confirmation (NTC). For IR-NTC systems based on {\em finite-length} codes (with blocklength $N$) and decoding attempts only at {\em certain specified decoding times}, this paper presents the asymptotic expansion achieved by random coding, provides rate-compatible sphere-packing (RCSP) performance approximations, and presents simulation results of tail-biting convolutional codes. The information-theoretic analysis shows that values of $N$ relatively close to the expected latency yield the same random-coding achievability expansion as with $N = \infty$. However, the penalty introduced in the expansion by limiting decoding times is linear in the interval between decoding times. For binary symmetric channels, the RCSP approximation provides an efficiently-computed approximation of performance that shows excellent agreement with a family of rate-compatible, tail-biting convolutional codes in the short-latency regime. For the additive white Gaussian noise channel, bounded-distance decoding simplifies the computation of the marginal RCSP approximation and produces similar results as analysis based on maximum-likelihood decoding for latencies greater than 200. The efficiency of the marginal RCSP approximation facilitates optimization of the lengths of incremental transmissions when the number of incremental transmissions is constrained to be small or the length of the incremental transmissions is constrained to be uniform after the first transmission. Finally, an RCSP-based decoding error trajectory is introduced that provides target error rates for the design of rate-compatible code families for use in feedback communication systems.Comment: 23 pages, 15 figure